Description: 运动员最佳配对问题，无和集问题，整数变换问题，无优先级运算，0-1背包问题-Athletes the best matching problems, and sets no problem, Integer Transform problem, no priority computing ,0-1 Knapsack Problem Platform: |
Size: 150528 |
Author:赵冉 |
Hits:
Description: vb环境下用动态规划方法编的0/1背包问题-vb environment made using dynamic programming method of 0/1 knapsack problem Platform: |
Size: 3072 |
Author:qj |
Hits:
Description: 很方便解决背包问题的好源码相信会给大家带来方便
-Very convenient to solve knapsack problem a good source I believe will bring convenience to everyone Platform: |
Size: 20480 |
Author:付梅彦 |
Hits:
Description: 背包问题是一个经典的动态规划模型。它既简单形象容易理解，又在某种程度上能够揭示动态规划的本质-Knapsack problem is a classic dynamic programming model. It is simple and easy to understand images, but also to some extent, able to reveal the essence of dynamic programming Platform: |
Size: 330752 |
Author:于维川 |
Hits:
Description: 0-1背包问题（0-1 Knapsack Problem）的定义为：设集合 代表m件物品,正整数 分别表示第 件物品的价值与重量，那么0-1背包问题KNAP(A,c)定义为,求A的子集，使得重量之和小于背包的容量c，并使得价值和最大。-0-1 knapsack problem (0-1 Knapsack Problem) is defined as: set up a collection on behalf of m items, respectively, the first positive integer value of items and weight, then the 0-1 knapsack problem KNAP (A, c) is defined as, A subset of demand, making less than the weight of the backpack and the capacity c, and make the value and the greatest. Platform: |
Size: 2048 |
Author:chj |
Hits:
Description: 背包问题
采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~
-Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, qualified! The machine for some internship students can come to the next ~ Platform: |
Size: 1024 |
Author:ohyoung |
Hits:
Description: 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code Platform: |
Size: 22528 |
Author:lius |
Hits:
Description: 算法中的经典问题：0——1 背包问题
在该程序中运用了动态规划算法成功解决了0——1背包问题-Classic problem of algorithm 0- 1 knapsack problem in the process use of dynamic programming algorithms succeeded in solving 0- 1 Knapsack Problem Platform: |
Size: 1024 |
Author:shisir |
Hits:
Description: 01背包问题，里面有四种算法，分别为动态规划，分支限定发，回溯法和谈新算法！-01 knapsack problem, there are four kinds of algorithms, dynamic programming, respectively, branch limit hair, the new algorithm backtracking peace! Platform: |
Size: 247808 |
Author:chenchen |
Hits:
Description: //0-1背包问题动态规划解法，原自王晓东算法设计，该程序已调通-//0-1 knapsack problem dynamic programming method, the original algorithm since Xiaodong design, the program has been transferred Qualcomm Platform: |
Size: 1024 |
Author:ss |
Hits:
Description: 本程序是在MATLAB平台上，利用智能优化算法遗传算法来解决01背包问题。在0 / 1背包问题中，需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品，每件物品i 的重量为wi ，价值为pi 。对于可行的背包装载，背包中物品的总重量不能超过背包的容量，最佳装载是指所装入的物品价值最高。-This procedure is in the MATLAB platform using intelligent genetic algorithm optimization algorithm to solve the 01 knapsack problem. In the 0/1 knapsack problem, there is a need for a capacity of c for the loaded backpack. From the n-items, select the items into the backpack, each item i the weight of wi, the value of pi. Feasible for loading backpack, backpack items total weight can not exceed the capacity of backpack, the best load is the value of the items loaded the highest. Platform: |
Size: 1024 |
Author:周薇 |
Hits:
Description: 本程序是在MATLAB平台上面实现的用模拟退火算法解决01背包问题。-This procedure is in the MATLAB platform achieved with simulated annealing algorithm to solve knapsack problem 01. Platform: |
Size: 1024 |
Author:周薇 |
Hits:
Search - knapsack problem